On two-connected subgraph polytopes
نویسندگان
چکیده
منابع مشابه
Polytopes from Subgraph Statistics
We study polytopes that are convex hulls of vectors of subgraph densities. Many graph theoretical questions can be expressed in terms of these polytopes, and statisticians use them to understand exponential random graph models. Relations among their Ehrhart polynomials are described, their duals are applied to certify that polynomials are nonnegative, and we find some of their faces. For the ge...
متن کاملSmall bipartite subgraph polytopes
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کاملSubgraph polytopes and independence polytopes of count matroids
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a nonempty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong relationship between the non-empty subgraph polytope and the spanning forest polytope. We further show that these polytopes provide polynomial size extended for...
متن کاملHigh connectivity keeping connected subgraph
It was proved by Mader that, for every integer l, every k-connected graph of sufficiently large order contains a vertex set X of order precisely l such that G−X is (k − 2)-connected. This is no longer true if we require X to be connected, even for l = 3. Motivated by this fact, we are trying to find an ”obstruction” for k-connected graphs without such a connected subgraph. It turns out that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00255-h